Report on the Larch Shared Language 105 -

نویسنده

  • J. V. GUTTAG
چکیده

Each member of the Larch family of formal specification languages has a component derived from a programming language and another component common to all programming languages. We call the former interface languages, and the latter the Larch Shared Language. This paper presents version 1.1 of the Larch Shared Language. It has two major sections. The first part starts with a brief introduction to the Larch Project and the Larch family of languages, and continues with an informal presentation of most of the features of the Larch Shared Language. It concludes with a brief discussion of how we expect Larch Shared Language Specifications to be used, a discussion of some of the more important design decisions, and a summary of the current status of the Larch project. The second part of this paper is a reference manual. A companion paper includes an extensive set of examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Debugging Larch Shared Language Specifications

The Larch family of specification languages supports a two-tiered definitional approach to specification. Each specification has components written in two languages: one designed for a specific programming language and another independent of any programming language. The former are called Larch interface languages, and the latter the Larch Shared Language (LSL). The Larch style of specification...

متن کامل

The Larch Shared Language: Some Open Problems

The Larch Shared Languagefor the specification of abstract data types has evolved over a number of years from a simple algebraic language to one that is both more complicated and more useful. This talk reviews some of its major design decisions and then discussessome of the design issues and remaining open problems—most of which are consequencesof the same decisions that contribute to LSL’s goo...

متن کامل

Verifying timing properties of concurrent algorithms

This paper presents a method for computer-aided veri cation of timing properties of real-time systems. A timed automaton model, along with invariant assertion and simulation techniques for proving properties of real-time systems, is formalized within the Larch Shared Language. This framework is then used to prove time bounds for two sample algorithms|a simple counter and Fischer's mutual exclus...

متن کامل

Interpreting Syntropy in Larch

This paper presents a formal axiomatic semantics for the essential model notations of Syntropy, where an essential model provides a step towards the speci cation of an object-oriented system. Syntropy like other objectoriented development methods uses intuitive and easy to understand graphical notations for expressing the static and dynamic aspects of the model. However, Syntropy di ers from ot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003